Pairwise Semi Star Generalized Homeomorphisms

( τ 1 , τ 2 ) ∗ - semi star generalized locally closed sets

The aim of this paper is to continue the study of (τ1, τ2) ∗-semi star generalized closed sets by introducing the concepts of (τ1, τ2) ∗-semi star generalized locally closed sets and study their basic properties in bitopological spaces. Keywords—(τ1, τ2) ∗-semi star generalized locally closed sets, τ1τ2-semi star generalized closed sets, (τ1, τ2) ∗-semi generalized locally closed sets, (τ1, τ2)...

Complete semi-conjugacies for psuedo-Anosov homeomorphisms

Suppose S is a surface of genus ≥ 2, f : S → S is a surface homeomorphism isotopic to a pseudo-Anosov map α and suppose S̃ is the universal cover of S and F and A are lifts of f and α respectively. A result of A. Fathi shows there is a semiconjugacy Θ : S̃ → L̄ × L̄ from F to Ā, where L̄ (L̄) is the completion of the R-tree of leaves of the stable (resp. unstable) foliation for A and Ā is the map ind...

Active Semi-Supervision for Pairwise Constrained Clustering

Semi-supervised clustering uses a small amount of supervised data to aid unsupervised learning. One typical approach specifies a limited number of must-link and cannotlink constraints between pairs of examples. This paper presents a pairwise constrained clustering framework and a new method for actively selecting informative pairwise constraints to get improved clustering performance. The clust...

Semi-Supervised Metric Learning Using Pairwise Constraints

Distance metric has an important role in many machine learning algorithms. Recently, metric learning for semi-supervised algorithms has received much attention. For semi-supervised clustering, usually a set of pairwise similarity and dissimilarity constraints is provided as supervisory information. Until now, various metric learning methods utilizing pairwise constraints have been proposed. The...

A tive Semi - Supervision for Pairwise Constrained